290. Word Pattern

Problem Statement

Given a pattern and a string s, find if s follows the same pattern.

Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in s.

Example 1:

Input: pattern = "abba", s = "dog cat cat dog"
Output: true

Example 2:

Input: pattern = "abba", s = "dog cat cat fish"
Output: false

Example 3:

Input: pattern = "aaaa", s = "dog cat cat dog"
Output: false

Constraints:

1 <= pattern.length <= 300
pattern contains only lower-case English letters.
1 <= s.length <= 3000
s contains only lowercase English letters and spaces ' '.
s does not contain any leading or trailing spaces.
All the words in s are separated by a single space.

Solution:

package main

import "strings"

func wordPattern(pattern string, s string) bool {
	words := strings.Split(s, " ")

	if len(pattern) != len(words) {
		return false
	}

	map_ := make(map[byte]string)

	// loop through the pattern and process each character
	for i := 0; i < len(pattern); i++ {
		// if the word is already in the map, check if it matches the pattern
		if val, ok := map_[pattern[i]]; ok {
			if val != words[i] {
				return false
			}
		} else {
			// loop through the map to check if map contains the word
			for _, v := range map_ {
				// if the word is in the map, return false
				if v == words[i] {
					return false
				}
			}

			// if the word is not in the map, add it
			map_[pattern[i]] = words[i]
		}
	}

	return true
}

290. Word Pattern #

Problem Statement #

Solution: #

... #

290. Word Pattern

Problem Statement

Solution:

...